Applying Representative Uninorms for Phonetic Classifier Combination

نویسندگان

  • Gábor Gosztolya
  • József Dombi
چکیده

When combining classifiers, we aggregate the output of different machine learning methods, and base our decision on the aggregated probability values instead of the individual ones. In the phoneme classification task of speech recognition, small excerpts of speech need to be identified as one of the pre-defined phonemes; but the probability value assigned to each possible phoneme also hold valuable information. This is why, when combining classifier output in this task, we must use a combination scheme which can aggregate the output probability values of the basic classifiers in a robust way. We tested the representative uninorms for this task, and were able to significantly outperform all the basic classifiers tested.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SUOWA operators: Constructing semi-uninorms and analyzing specific cases

SUOWA operators are a new family of aggregation functions that simultaneously generalize weighted means and OWA operators. Semi-uninorms, which are an extension of uninorms by dispensing with the symmetry and associativity properties, play a fundamental role in their definition. In this paper we show several procedures to construct semi-uninorms. The first one allows us to obtain continuous sem...

متن کامل

Research on several problems about uninorms

Uninorms introduced by Yager in 1996 are a new class of aggregation operators, which are also an important generalization of t-norms and t-conorms. At present, uninorms have been widely used in lots of fields such as expert system, decision making, fuzzy reasoning, image processing and so on. In the theoretical study about this class of operators, several subclasses emerged, and some extensions...

متن کامل

A Comparison of Graph Construction and Learning Algorithms for Graph-Based Phonetic Classification

Graph-based semi-supervised learning (SSL) algorithms have been widely applied in large-scale machine learning. In this work, we show different graph-based SSL methods (modified adsorption, measure propagation, and prior-based measure propagation) and compare them to the standard label propagation algorithm on a phonetic classification task. In addition, we compare 4 different ways of construct...

متن کامل

Optimizing Phonetic Encoding for Viennese Unit Selection Speech Synthesis

While developing lexical resources for a particular language variety (Viennese), we experimented with a set of 5 different phonetic encodings, termed phone sets, used for unit selection speech synthesis. We started with a very rich phone set based on phonological considerations and covering as much phonetic variability as possible, which was then reduced to smaller sets by applying transformati...

متن کامل

Left and right semi-uninorms on a complete lattice

Uninorms are important generalizations of triangular norms and conorms, with a neutral element lying anywhere in the unit interval, and left (right) semi-uninorms are non-commutative and non-associative extensions of uninorms. In this paper, we firstly introduce the concepts of left and right semi-uninorms on a complete lattice and illustrate these notions by means of some examples. Then, we la...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014